Editorial: Perhaps some parallels do converge?

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Editorial—some anniversaries

The year 1996 has been of some anniversary import in the field of epilepsy. The British Branch of the International League Against Epilepsy celebrated its Diamond Jubilee meeting in May, having been founded in 1936. The 60 years of its existence have seen a lot of changes. The Branch seems to have started almost as a private club for a few doctors with an interest in epilepsy to read papers to ...

متن کامل

Do dissolving objects converge to a universal shape?

Surprisingly, macroscopic objects such as melting ice cubes and growing stalactites approach nonintuitive geometric ideals. Here we investigate the shape of dissolving cylinders in a large volume of water. The cylinders are oriented vertically and consist of amorphous glucose or poly(ethylene glycol). The dissolution causes density differences in the surrounding fluid, which induce gravity-driv...

متن کامل

When Do Gossip Algorithms Converge in Finite Time?

In this paper, we study finite-time convergence of gossip algorithms. We show that there exists a symmetric gossip algorithm that converges in finite time if and only if the number of network nodes is a power of two, while there always exists a globally finite-time convergent gossip algorithm despite the number of nodes if asymmetric gossiping is allowed. For n = 2 nodes, we prove that a fastes...

متن کامل

Which Training Methods for GANs do actually Converge?

Recent work has shown local convergence of GAN training for absolutely continuous data and generator distributions. In this note we show that the requirement of absolute continuity is necessary: we describe a simple yet prototypical counterexample showing that in the more realistic case of distributions that are not absolutely continuous, unregularized GAN training is generally not convergent. ...

متن کامل

How fast do equilibrium payoff sets converge in repeated games?

We provide tight bounds on the rate of convergence of the equilibrium payo sets for repeated games under both perfect and imperfect public monitoring. The distance between the equilibrium payo set and its limit vanishes at rate (1− δ)1/2 under perfect monitoring, and at rate (1− δ)1/4 under imperfect monitoring. For strictly individually rational payo vectors, these rates improve to 0 (i.e., al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Software Testing, Verification and Reliability

سال: 2003

ISSN: 0960-0833,1099-1689

DOI: 10.1002/stvr.265